package ljl.alg.jianzhioffer.round3.easy;

import commons.TreeNode;

public class _55_maxDepth {

    public int maxDepth(TreeNode root) {
        if (root == null)
            return 0;
        return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
    }

}
